Chomsky normal form
チョムスキー標準形
Backus–Naur form
CYK algorithm
Greibach normal form
Kuroda normal form
Pumping lemma for context-free languages
— its proof relies on the Chomsky normal form
https://en.wikipedia.org/wiki/Chomsky_normal_form